Forward-Backward EM-TV methods for inverse problems with Poisson noise
نویسندگان
چکیده
We address the task of reconstructing images corrupted by Poisson noise, which is important in various applications, such as fluorescence microscopy, positron emission tomography (PET), or astronomical imaging. In this work, we focus on reconstruction strategies, combining the expectation-maximization (EM) algorithm and total variation (TV) based regularization, and present a detailed analysis as well as numerical results. Recently extensions of the well known EM/Richardson-Lucy algorithm received increasing attention for inverse problems with Poisson data. However, most algorithms for regularizations like TV lead to convergence problems for large regularization parameters, cannot guarantee positivity, and rely on additional approximations (like smoothed TV). The goal of this work is to provide an accurate, robust and fast FB-EM-TV method for computing cartoon reconstructions facilitating post-segmentation and further image quantifications. Motivated by several applications we provide a statistical modeling of inverse problems with Poisson noise in terms of Bayesian MAP estimation and relate it to the continuous variational setting. We focus on minimizing the energy functional with the Kullback-Leibler divergence as the data fidelity and TV as regularization, subject to non-negativity constraints. Our proposed FB-EM-TV minimization algorithm is a semi-implicit, alternating two step method consisting of an EM step and the solution of a weighted ROF problem. The method can be reinterpreted as a modified forward-backward (FB) splitting strategy known from convex optimization. First of all, we establish the wellposedness of the variational problem under general conditions, in particular we give a proof of existence, uniqueness and stability. Under certain assumptions on the given data, we can prove positivity preservation of our iteration method. A damped variant of the FB-EM-TV algorithm, interpreted as a splitting strategy with modified time steps, is the key step towards global convergence. In addition, we present a Bregman-FB-EM-TV strategy, extending the FB-EM-TV framework, which corrects the natural loss of contrast using TV via iterative Bregman distance regularization. Finally, we illustrate the performance of the proposed algorithms and confirm the analytical concepts by 2D and 3D synthetic and real-world results in optical nanoscopy and positron emission tomography. Forward-Backward EM-TV methods for inverse problems with Poisson noise 2
منابع مشابه
(Nonlocal) Total Variation in Medical Imaging
This thesis deals with the reconstruction of images where the measured data are corrupted by Poisson noise and a specific signal-dependent speckle noise, which occurs e.g. in medical ultrasound images. Since both noise types fundamentally differ from the frequently studied additive Gaussian noise in mathematical image processing, adapted variational models are required to handle these types of ...
متن کاملTotal Variation 5 Penalized Image Restoration
The total variation (TV) minimization models are widely used in image processing, 16 mainly due to their remarkable ability in preserving edges. There are many methods 17 for solving the TV model. These methods, however, seldom consider the positivity con18 straint one should impose on image-processing problems. In this paper we develop and 19 implement a new approach for TV image restoration. ...
متن کاملBregman-EM-TV Methods with Application to Optical Nanoscopy
Measurements in nanoscopic imaging suffer from blurring effects concerning different point spread functions (PSF). Some apparatus even have PSFs that are locally dependent on phase shifts. Additionally, raw data are affected by Poisson noise resulting from laser sampling and "photon counts" in fluorescence microscopy. In these applications standard reconstruction methods (EM, filtered backproje...
متن کاملILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملA Field Guide to Forward-Backward Splitting with a FASTA Implementation
Non-differentiable and constrained optimization play a key role in machine learning, signal and image processing, communications, and beyond. For highdimensional minimization problems involving large datasets or many unknowns, the forward-backward splitting method (also known as the proximal gradient method) provides a simple, yet practical solver. Despite its apparent simplicity, the performan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011